A Genetic Algorithm Approach to the Artillery Target Assignment Problem

In this work a new assignment problem with the name “Artillery Target Assignment Problem (ATAP)” is defined. ATAP is about assigning artillery guns to targets at different time instances while some objective functions are to be optimized. Since an assignment made for any time instance effect the value of the shooting ATAP is harder than the classical assignment problem. As far as the objective functions are concerned we define a base case problem. We elaborate on some possible variations of the base case which are exceptionally interesting in the military domain. For two of such problems, genetic algorithm solutions with customized representations and genetic operators are developed and presented.